CNOT circuit extraction for topologically-constrained quantum memories
نویسندگان
چکیده
منابع مشابه
Asymptotic bounds of depth for the reversible circuit consisting of NOT, CNOT and 2-CNOT gates
The paper discusses the asymptotic depth of a reversible circuit consisting of NOT, CNOT and 2-CNOT gates. Reversible circuit depth function $D(n, q)$ for a circuit implementing a transformation $f\colon \mathbb Z_2^n \to \mathbb Z_2^n$ is introduced as a function of $n$ and the number of additional inputs $q$. It is proved that for the case of implementing a permutation from $A(\mathbb Z_2^n)$...
متن کاملTopologically Constrained Isometric Embedding
We present a new algorithm for nonlinear dimensionality reduction that consistently uses global information, which enables understanding the intrinsic geometry of non-convex manifolds. Compared to methods that consider only local information, our method appears to be more robust to noise. We demonstrate the performance of our algorithm and compare it to state-of-the-art methods on synthetic a...
متن کاملThe statistics of the entanglement changes generated by the Hadamard - CNOT quantum circuit
We consider the change of entanglement of formation ∆E produced by the Hadamard-CNOT circuit on a general (pure or mixed) state ρ describing a system of two qubits. We study numerically the probabilities of obtaining different values of ∆E, assuming that the initial state is randomly distributed in the space of all states according to the product measure recently introduced by Zyczkowski et al.
متن کاملHybrid Control for Topologically Constrained Systems
Hybrid Control for Topologically Constrained Systems
متن کاملGraph states of prime-power dimension from generalized CNOT quantum circuit
We construct multipartite graph states whose dimension is the power of a prime number. This is realized by the finite field, as well as the generalized controlled-NOT quantum circuit acting on two qudits. We propose the standard form of graph states up to local unitary transformations and particle permutations. The form greatly simplifies the classification of graph states as we illustrate up t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2020
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic20.7-8-4